Processes and unfoldings: concurrent computations in adhesive categories

نویسندگان

  • Paolo Baldan
  • Andrea Corradini
  • Tobias Heindel
  • Barbara König
  • Pawel Sobocinski
چکیده

P A O L O B A L D A N1 and A N D R E A C O R R A D I N I2 and T O B I A S H E I N D E L3 and B A R B A R A K Ö N I G4 and P A W E Ł S O B O C I Ń S K I5 1Dipartimento di Matematica Pura e Applicata, Università di Padova, Italy 2Dipartimento di Informatica, Università di Pisa, Italy 3Institut CARNOT, CEA LIST, Gif sur Yvette, France 4Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen, Germany 5ECS, University of Southampton, United Kingdom

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A category theoretical approach to the concurrent semantics of rewriting: adhesive categories and related concepts

This thesis studies formal semantics for a family of rewriting formalisms that have arisen as category theoretical abstractions of the so-called algebraic approaches to graph rewriting. The latter in turn generalize and combine features of term rewriting and Petri nets. Two salient features of (the abstract versions of) graph rewriting are a suitable class of categories which captures the struc...

متن کامل

Abstract True Concurrency: Adhesive Processes

True Concurrency: Adhesive Processes Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, and Pawe l Sobociński 1 Dipartimento di Informatica, Università Ca’ Foscari di Venezia, Italy 2 Dipartimento di Informatica, Università di Pisa, Italy 3 Institut für Formale Methoden der Informatik, Universität Stuttgart, Germany 4 Computer Laboratory, University of Cambridge, United Kingdom Abst...

متن کامل

Subobject Transformation Systems and Elementary Net Systems

Graph transformation systems (GTSs) [10] are a powerful specification formalism for concurrent and distributed systems, generalising another classical model of concurrency, namely Place/Transition Petri nets [8]. Along the years, the concurrent behaviour of GTSs has been deeply studied and a consolidated theory of concurrency is now available. In particular, by exploiting the relationship with ...

متن کامل

Processes for Adhesive Rewriting Systems

Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, including various modelling frameworks for concurrent and distributed systems. Here we begin the development of a truly concurrent semantics for adhesive rewriting systems by defining the fundamental notion of process, well-known fro...

متن کامل

Verification based on unfoldings of Petri nets with read arcs. (Vérification à l'aide de dépliages de réseaux de Petri étendus avec des arcs de lecture)

Humans make mistakes, especially when faced to complex tasks, such as the construction of modern hardware or software. This thesis focuses on machine-assisted techniques to guarantee that computers behave correctly. Modern computer systems are large and complex. Automated formal verification stands as an alternative to testing or simulation to ensuring their reliability. It essentially proposes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Mathematical Structures in Computer Science

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2014